Regular orbits of finite primitive solvable groups, III

نویسندگان

چکیده

Suppose that a finite solvable group G acts faithfully, irreducibly and quasi-primitively on vector space V, is not metacyclic. Then always has regular orbit V except for few “small” cases.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complex Orbits of Solvable Groups

The following structure theorems are proved: An orbit of a real solvable Lie group in projective space that is a complex submanifold is isomorphic to C x (C*)m x Í2 , where Í2 is an open orbit of a real solvable Lie group in a projective rational variety. Also, any homogeneous space of a complex Lie group that is isomorphic to C" can be realized as an orbit in some projective space. As a conseq...

متن کامل

finite bci-groups are solvable

‎let $s$ be a subset of a finite group $g$‎. ‎the bi-cayley graph ${rm bcay}(g,s)$ of $g$ with respect to $s$ is an undirected graph with vertex set $gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin g‎, ‎ sin s}$‎. ‎a bi-cayley graph ${rm bcay}(g,s)$ is called a bci-graph if for any bi-cayley graph ${rm bcay}(g,t)$‎, ‎whenever ${rm bcay}(g,s)cong {rm bcay}(g,t)$ we have $t=gs^alpha$ for some $...

متن کامل

Group Membership for Groups with Primitive Orbits

This paper considers a permutation group G = 〈S〉 of degree n with t orbits such that the action on each orbit is primitive. It presents a O(tn2 logc(n)) time Monte Carlo group membership algorithm for some constant c. The algorithm is notable for its use of a new theorem showing how to find O(t log n) generators in O (̃|S|n) time under a more general form of the above hypotheses. The algorithm r...

متن کامل

Parallel Construction of Finite Solvable Groups

An algorithm for the construction of nite solvable groups of small order is given. A parallelized version under PVM is presented. Diierent models for parallelization are discussed. A nite group G is called solvable, if there exists a chain of normal subgroups

متن کامل

Finite subnormal coverings of certain solvable groups

A group is said to have a finite covering by subgroups if it is the set theoretic union of finitely many subgroups. A theorem of B. H. Neumann [11] characterizes groups with finite coverings by proper subgroups as precisely those groups with finite non-cyclic homomorphic images. R. Baer (see [13, Theorem 4.16]) proved that a group has a finite covering by abelian subgroups if and only if it is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2022

ISSN: ['1090-266X', '0021-8693']

DOI: https://doi.org/10.1016/j.jalgebra.2021.08.027